________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        03.02.2010 21:57:15
Input Data from:  dataset165.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :300
# of Locations  :20
Ex.Facilities   :2
Total budget    :25000
Terror. attacks :3

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,0666666666666667
Average f[i]   :4450
Average g[i,j] :2016,66666666667
Total demand   :16810
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 19
> Selected Move:	0	1	-1	2	4500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 18
> Selected Move:	1020	1	-1	3	8500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 1020


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 81
> Selected Move:	1650	1	-1	4	14000


> New Y[]: 
	
	 2  3  1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 1650


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 84
> Selected Move:	2750	1	-1	7	20500


> New Y[]: 
	
	 2  3  1  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 2750


> New S[]: 
	
	 1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 104
> Selected Move:	3640	1	-1	10	24500


> New Y[]: 
	
	 2  3  1  1  1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0    >new incumb.: 3640


> New S[]: 
	
	 1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 93
> Selected Move:	3830	3	2	15	25500


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  0  0  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 78
> Selected Move:	4330	3	7	19	25000


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  0  1  0  0  0  0  1  0  0  0  1    >new incumb.: 4330


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 91
> Selected Move:	4420	3	10	13	25000


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  0  0  0  0  1  0  1  0  0  0  1    >new incumb.: 4420


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 90
> Selected Move:	4370	3	19	17	24500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 103
> Selected Move:	4280	3	13	10	24500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 103
> Selected Move:	4180	3	4	13	23000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  1  0  0  1  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 107
> Selected Move:	4310	3	17	19	23500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  1  0  0  1  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 99
> Selected Move:	4350	3	10	12	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  1  1  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 92
> Selected Move:	4220	3	19	17	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  1  1  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 94
> Selected Move:	4210	3	17	4	24500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  0  0  0  1  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 106
> Selected Move:	4210	3	15	9	25000


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 107
> Selected Move:	4170	3	12	10	23500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  1  1  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 115
> Selected Move:	4170	3	9	15	23000


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  0  1  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 108
> Selected Move:	4110	3	3	19	25000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  1  0  0  1  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 79
> Selected Move:	4270	3	10	6	25000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  0  0  1  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 94
> Selected Move:	4220	3	19	17	24500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  0  0  1  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 98
> Selected Move:	4130	3	13	10	24500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  1  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 102
> Selected Move:	4180	3	17	19	25000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  1  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 100
> Selected Move:	4080	3	10	8	25000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  1  0  0  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 92
> Selected Move:	4230	3	6	3	25000


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  1  0  0  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 107
> Selected Move:	4200	3	4	13	23500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 102
> Selected Move:	4110	3	8	14	23500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  1  1  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 112
> Selected Move:	4130	3	13	4	25000


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 108
> Selected Move:	4080	3	19	17	24500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  0  0  0  0  0  1  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 111
> Selected Move:	4180	3	14	8	24500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  1  0  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 109
> Selected Move:	4080	3	4	13	23000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  0  0  0  1  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 105
> Selected Move:	4180	1	-1	10	27000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  1  0  0  1  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 86
> Selected Move:	4415	3	17	14	25500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  1  0  0  1  1  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 116
> Selected Move:	4318	3	14	6	25500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  0  1  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 110
> Selected Move:	4400	3	15	18	25000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  0  1  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 121
> Selected Move:	4323	3	18	4	25500


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  1  0  1  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 119
> Selected Move:	4325	3	4	17	25500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  0  1  0  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,355

## ITERATION 37 #######################


> Neighbours evaluated; 113
> Selected Move:	4263	3	8	14	25500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  1  0  0  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,36

## ITERATION 38 #######################


> Neighbours evaluated; 121
> Selected Move:	4280	3	17	18	25000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  1  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 39 #######################


> Neighbours evaluated; 123
> Selected Move:	4258	3	18	4	25500


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  0  0  1  0  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 40 #######################


> Neighbours evaluated; 120
> Selected Move:	4255	3	4	15	25500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  1  0  0  1  1  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,375

## ITERATION 41 #######################


> Neighbours evaluated; 117
> Selected Move:	4213	3	6	11	25500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  1  1  0  1  1  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,38

## ITERATION 42 #######################


> Neighbours evaluated; 119
> Selected Move:	4260	3	14	8	25500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  1  1  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,385

## ITERATION 43 #######################


> Neighbours evaluated; 112
> Selected Move:	4150	3	11	4	27000


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  1  0  1  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,39

## ITERATION 44 #######################


> Neighbours evaluated; 93
> Selected Move:	4215	3	15	14	25500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  1  0  1  0  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 45 #######################


> Neighbours evaluated; 118
> Selected Move:	4260	3	4	16	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  1  0  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 46 #######################


> Neighbours evaluated; 120
> Selected Move:	4210	3	16	6	24000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  0  1  0  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 47 #######################


> Neighbours evaluated; 113
> Selected Move:	4250	3	14	2	24500


> New Y[]: 
	
	 2  3  1  1  0  0  1  0  1  0  1  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 48 #######################


> Neighbours evaluated; 106
> Selected Move:	4090	3	2	9	26000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  1  1  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 49 #######################


> Neighbours evaluated; 104
> Selected Move:	4145	3	6	14	26000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  1  1  0  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 50 #######################


> Neighbours evaluated; 111
> Selected Move:	4190	3	9	17	25500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  1  0  0  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 51 #######################


> Neighbours evaluated; 108
> Selected Move:	4148	3	3	6	25500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  1  0  0  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,43

## ITERATION 52 #######################


> Neighbours evaluated; 103
> Selected Move:	4145	3	17	4	25500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  1  0  1  0  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 53 #######################


> Neighbours evaluated; 112
> Selected Move:	4143	3	4	15	25500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  1  0  0  1  1  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,44

## ITERATION 54 #######################


> Neighbours evaluated; 101
> Selected Move:	4120	3	10	3	25500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  0  0  0  0  1  1  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,445

## ITERATION 55 #######################


> Neighbours evaluated; 106
> Selected Move:	4180	3	15	18	25000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 56 #######################


> Neighbours evaluated; 112
> Selected Move:	4115	3	18	4	25500


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  1  0  0  0  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 57 #######################


> Neighbours evaluated; 109
> Selected Move:	4113	3	4	17	25500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  0  0  0  0  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,46

## ITERATION 58 #######################


> Neighbours evaluated; 105
> Selected Move:	4050	3	17	2	24500


> New Y[]: 
	
	 2  3  1  1  0  0  1  0  1  0  0  0  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 59 #######################


> Neighbours evaluated; 105
> Selected Move:	4090	3	8	10	24500


> New Y[]: 
	
	 2  3  1  1  0  0  1  0  0  0  1  0  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 60 #######################


> Neighbours evaluated; 104
> Selected Move:	4020	3	2	11	24000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  1  1  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 61 #######################


> Neighbours evaluated; 114
> Selected Move:	4190	3	14	18	25000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  1  1  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 62 #######################


> Neighbours evaluated; 115
> Selected Move:	4090	3	10	8	25000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  0  0  1  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 63 #######################


> Neighbours evaluated; 113
> Selected Move:	4080	3	18	10	24000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  0  1  1  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 64 #######################


> Neighbours evaluated; 112
> Selected Move:	4130	3	6	16	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  1  1  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 65 #######################


> Neighbours evaluated; 115
> Selected Move:	4070	3	8	14	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  1  1  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 66 #######################


> Neighbours evaluated; 118
> Selected Move:	3970	3	10	8	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  0  1  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 67 #######################


> Neighbours evaluated; 113
> Selected Move:	4063	3	16	15	25500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  0  1  0  1  1  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,45

## ITERATION 68 #######################


> Neighbours evaluated; 109
> Selected Move:	3965	3	13	10	25500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  1  1  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,445

## ITERATION 69 #######################


> Neighbours evaluated; 112
> Selected Move:	3988	3	11	6	25500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  0  1  0  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,44

## ITERATION 70 #######################


> Neighbours evaluated; 109
> Selected Move:	4050	3	15	18	25000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  0  1  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 71 #######################


> Neighbours evaluated; 113
> Selected Move:	4050	3	3	13	25000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  1  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 72 #######################


> Neighbours evaluated; 106
> Selected Move:	4050	3	6	3	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  1  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 73 #######################


> Neighbours evaluated; 112
> Selected Move:	4025	3	18	19	26000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  1  0  0  1  1  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 74 #######################


> Neighbours evaluated; 105
> Selected Move:	4080	3	14	6	26000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  0  1  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,425

## ITERATION 75 #######################


> Neighbours evaluated; 95
> Selected Move:	4015	3	8	14	26000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  1  0  0  1  1  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,43

## ITERATION 76 #######################


> Neighbours evaluated; 105
> Selected Move:	4010	3	19	9	26000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  1  1  0  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 77 #######################


> Neighbours evaluated; 110
> Selected Move:	3925	3	3	8	26000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  1  1  0  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 78 #######################


> Neighbours evaluated; 105
> Selected Move:	3920	3	9	2	24500


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  1  0  1  0  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 79 #######################


> Neighbours evaluated; 100
> Selected Move:	3920	3	6	3	24500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  1  0  1  0  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 80 #######################


> Neighbours evaluated; 102
> Selected Move:	4045	3	14	16	25500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  1  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,455

## ITERATION 81 #######################


> Neighbours evaluated; 85
> Selected Move:	3945	3	2	18	26000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  1  0  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,46

## ITERATION 82 #######################


> Neighbours evaluated; 98
> Selected Move:	3980	3	16	11	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  1  1  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 83 #######################


> Neighbours evaluated; 110
> Selected Move:	4028	3	18	4	25500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  1  0  1  1  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 84 #######################


> Neighbours evaluated; 112
> Selected Move:	4055	3	8	6	25500


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  0  0  1  1  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 85 #######################


> Neighbours evaluated; 112
> Selected Move:	4052	3	4	15	25500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  1  1  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,48

## ITERATION 86 #######################


> Neighbours evaluated; 105
> Selected Move:	4050	3	15	17	25500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  1  1  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,485

## ITERATION 87 #######################


> Neighbours evaluated; 105
> Selected Move:	4020	3	17	2	24500


> New Y[]: 
	
	 2  3  1  1  0  0  1  0  0  0  1  1  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 88 #######################


> Neighbours evaluated; 107
> Selected Move:	3960	3	10	8	24500


> New Y[]: 
	
	 2  3  1  1  0  0  1  0  1  0  0  1  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 89 #######################


> Neighbours evaluated; 107
> Selected Move:	3942	3	2	4	25500


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  1  0  0  1  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 90 #######################


> Neighbours evaluated; 109
> Selected Move:	3960	3	3	10	25500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  1  0  1  1  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,505

## ITERATION 91 #######################


> Neighbours evaluated; 109
> Selected Move:	3980	3	4	18	25000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  1  1  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,51

## ITERATION 92 #######################


> Neighbours evaluated; 107
> Selected Move:	3980	3	13	3	25000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  0  1  1  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,515

## ITERATION 93 #######################


> Neighbours evaluated; 109
> Selected Move:	3920	3	18	14	24000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  0  1  1  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,52

## ITERATION 94 #######################


> Neighbours evaluated; 113
> Selected Move:	3970	3	6	16	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  1  1  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,515

## ITERATION 95 #######################


> Neighbours evaluated; 113
> Selected Move:	3850	3	3	13	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  1  1  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,51

## ITERATION 96 #######################


> Neighbours evaluated; 104
> Selected Move:	3850	3	16	3	24000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  1  1  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,505

## ITERATION 97 #######################


> Neighbours evaluated; 101
> Selected Move:	3998	3	14	17	25500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  1  1  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 98 #######################


> Neighbours evaluated; 101
> Selected Move:	3960	3	3	6	25500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  1  1  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,495

## ITERATION 99 #######################


> Neighbours evaluated; 100
> Selected Move:	3962	3	17	15	25500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  1  1  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,49

## ITERATION 100 #######################


> Neighbours evaluated; 99
> Selected Move:	3945	3	10	3	25500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  0  0  1  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,485

## ITERATION 101 #######################


> Neighbours evaluated; 101
> Selected Move:	3948	3	15	17	25500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  0  0  1  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,49

## ITERATION 102 #######################


> Neighbours evaluated; 101
> Selected Move:	3920	3	17	14	24000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  0  0  1  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 103 #######################


> Neighbours evaluated; 103
> Selected Move:	3930	3	8	18	25000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  0  1  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 104 #######################


> Neighbours evaluated; 110
> Selected Move:	3860	3	3	10	25000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  1  1  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,505

## ITERATION 105 #######################


> Neighbours evaluated; 108
> Selected Move:	3898	3	18	4	25500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  1  1  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,51

## ITERATION 106 #######################


> Neighbours evaluated; 112
> Selected Move:	3945	3	6	3	25500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  0  1  1  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,515

## ITERATION 107 #######################


> Neighbours evaluated; 109
> Selected Move:	3932	3	4	17	25500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  1  1  0  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,52

## ITERATION 108 #######################


> Neighbours evaluated; 105
> Selected Move:	3890	3	3	6	25500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  1  1  0  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,525

## ITERATION 109 #######################


> Neighbours evaluated; 105
> Selected Move:	3888	3	17	15	25500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  1  1  0  1  1  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,53

## ITERATION 110 #######################


> Neighbours evaluated; 104
> Selected Move:	3850	3	15	8	24000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  1  1  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,535

## ITERATION 111 #######################


> Neighbours evaluated; 99
> Selected Move:	3850	3	14	2	24500


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  1  0  1  1  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,54

## ITERATION 112 #######################


> Neighbours evaluated; 96
> Selected Move:	3850	3	6	3	24500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  1  0  1  1  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,545

## ITERATION 113 #######################


> Neighbours evaluated; 98
> Selected Move:	3865	3	2	9	26000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  1  1  1  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,55

## ITERATION 114 #######################


> Neighbours evaluated; 99
> Selected Move:	3870	2	11	-1	22000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  1  1  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,555

## ITERATION 115 #######################


> Neighbours evaluated; 113
> Selected Move:	4070	3	10	4	23500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  1  1  0  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,56

## ITERATION 116 #######################


> Neighbours evaluated; 108
> Selected Move:	4070	3	9	15	23000


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,555

## ITERATION 117 #######################


> Neighbours evaluated; 104
> Selected Move:	4010	3	3	19	25000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  0  0  0  1  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,55

## ITERATION 118 #######################


> Neighbours evaluated; 73
> Selected Move:	4060	3	4	16	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  0  0  1  0  1  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,545

## ITERATION 119 #######################


> Neighbours evaluated; 68
> Selected Move:	4160	3	8	10	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  1  0  1  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,54

## ITERATION 120 #######################


> Neighbours evaluated; 83
> Selected Move:	4110	3	19	17	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  1  0  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,535

## ITERATION 121 #######################


> Neighbours evaluated; 88
> Selected Move:	4060	3	16	4	24500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  1  0  0  1  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,53

## ITERATION 122 #######################


> Neighbours evaluated; 82
> Selected Move:	4060	3	15	3	23000


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  0  1  0  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,525

## ITERATION 123 #######################


> Neighbours evaluated; 110
> Selected Move:	4110	3	17	19	23500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  0  1  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,52

## ITERATION 124 #######################


> Neighbours evaluated; 106
> Selected Move:	4150	3	10	12	25000


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  0  0  0  1  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,515

## ITERATION 125 #######################


> Neighbours evaluated; 99
> Selected Move:	4100	3	19	17	24500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  0  0  0  1  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,51

## ITERATION 126 #######################


> Neighbours evaluated; 104
> Selected Move:	4050	3	3	6	24500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  0  1  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,505

## ITERATION 127 #######################


> Neighbours evaluated; 103
> Selected Move:	4060	3	17	9	25000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  1  0  0  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 128 #######################


> Neighbours evaluated; 102
> Selected Move:	4060	3	9	15	24500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  0  1  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,495

## ITERATION 129 #######################


> Neighbours evaluated; 96
> Selected Move:	4100	3	4	19	25000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  0  1  1  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,49

## ITERATION 130 #######################


> Neighbours evaluated; 85
> Selected Move:	4060	3	12	10	23500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  1  0  0  1  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,485

## ITERATION 131 #######################


> Neighbours evaluated; 96
> Selected Move:	4060	3	15	9	24000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  1  1  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 132 #######################


> Neighbours evaluated; 106
> Selected Move:	4060	3	6	3	24000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  1  1  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 133 #######################


> Neighbours evaluated; 112
> Selected Move:	4060	3	3	16	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  1  0  0  1  0  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,47

## ITERATION 134 #######################


> Neighbours evaluated; 99
> Selected Move:	4050	3	10	3	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  1  0  0  0  1  0  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 135 #######################


> Neighbours evaluated; 108
> Selected Move:	4050	3	9	15	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  1  0  1  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,46

## ITERATION 136 #######################


> Neighbours evaluated; 102
> Selected Move:	4000	3	16	6	23500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  0  0  0  1  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,455

## ITERATION 137 #######################


> Neighbours evaluated; 102
> Selected Move:	4020	3	13	4	25000


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  0  0  0  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,45

## ITERATION 138 #######################


> Neighbours evaluated; 102
> Selected Move:	3980	3	3	14	25000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  0  0  0  1  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,445

## ITERATION 139 #######################


> Neighbours evaluated; 100
> Selected Move:	3930	3	19	17	24500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  0  0  0  1  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,44

## ITERATION 140 #######################


> Neighbours evaluated; 107
> Selected Move:	4030	3	14	8	24500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  1  0  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,435

## ITERATION 141 #######################


> Neighbours evaluated; 106
> Selected Move:	3970	3	8	3	24500


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  0  0  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,43

## ITERATION 142 #######################


> Neighbours evaluated; 103
> Selected Move:	3950	3	4	13	23000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  0  0  0  1  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,425

## ITERATION 143 #######################


> Neighbours evaluated; 106
> Selected Move:	4050	3	3	12	24500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  0  1  1  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,42

## ITERATION 144 #######################


> Neighbours evaluated; 92
> Selected Move:	4010	3	12	10	23000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  1  0  0  1  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,415

## ITERATION 145 #######################


> Neighbours evaluated; 104
> Selected Move:	4020	3	17	4	23000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  1  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,41

## ITERATION 146 #######################


> Neighbours evaluated; 109
> Selected Move:	4020	3	15	9	23500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  1  1  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 147 #######################


> Neighbours evaluated; 114
> Selected Move:	4020	3	9	19	23500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  1  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,4

## ITERATION 148 #######################


> Neighbours evaluated; 109
> Selected Move:	4060	3	10	12	25000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  0  1  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,395

## ITERATION 149 #######################


> Neighbours evaluated; 103
> Selected Move:	4023	3	12	9	25500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  1  0  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 150 #######################


> Neighbours evaluated; 97
> Selected Move:	4075	3	6	3	25500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 151 #######################


> Neighbours evaluated; 105
> Selected Move:	4010	3	9	8	23500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  1  0  0  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 152 #######################


> Neighbours evaluated; 110
> Selected Move:	3960	3	4	9	24000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  1  0  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 153 #######################


> Neighbours evaluated; 103
> Selected Move:	4000	3	8	6	24000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 154 #######################


> Neighbours evaluated; 107
> Selected Move:	3960	3	3	8	24000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  1  0  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 155 #######################


> Neighbours evaluated; 106
> Selected Move:	3960	3	6	16	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  0  0  1  0  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,36

## ITERATION 156 #######################


> Neighbours evaluated; 90
> Selected Move:	3860	3	8	14	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  0  0  1  1  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,355

## ITERATION 157 #######################


> Neighbours evaluated; 109
> Selected Move:	3960	3	9	15	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  1  1  1  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,35

## ITERATION 158 #######################


> Neighbours evaluated; 90
> Selected Move:	3910	3	16	4	25000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  0  0  1  1  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,345

## ITERATION 159 #######################


> Neighbours evaluated; 99
> Selected Move:	3970	3	19	3	23000


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  0  0  0  0  1  1  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,34

## ITERATION 160 #######################


> Neighbours evaluated; 110
> Selected Move:	4180	1	-1	10	27000


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  0  1  0  0  1  1  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,335

## ITERATION 161 #######################


> Neighbours evaluated; 113
> Selected Move:	4200	3	4	17	27000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  1  0  0  1  1  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 162 #######################


> Neighbours evaluated; 109
> Selected Move:	4180	3	14	6	27000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  1  0  0  1  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,325

## ITERATION 163 #######################


> Neighbours evaluated; 97
> Selected Move:	4123	3	6	4	28500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  0  1  0  0  1  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,32

## ITERATION 164 #######################


> Neighbours evaluated; 86
> Selected Move:	4170	3	15	8	27000


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  1  0  1  0  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 165 #######################


> Neighbours evaluated; 108
> Selected Move:	4110	3	3	6	27000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  1  0  1  0  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 166 #######################


> Neighbours evaluated; 106
> Selected Move:	4110	3	17	15	27000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  1  0  1  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,335

## ITERATION 167 #######################


> Neighbours evaluated; 104
> Selected Move:	4090	3	4	17	27000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  1  0  0  1  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,34

## ITERATION 168 #######################


> Neighbours evaluated; 79
> Selected Move:	4060	3	10	3	27000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  0  0  0  0  1  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,345

## ITERATION 169 #######################


> Neighbours evaluated; 82
> Selected Move:	4080	3	6	14	27000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  0  0  0  1  1  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 170 #######################


> Neighbours evaluated; 99
> Selected Move:	4060	3	17	4	27000


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  1  0  0  0  0  1  1  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,355

## ITERATION 171 #######################


> Neighbours evaluated; 106
> Selected Move:	4003	3	4	19	27500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  0  0  0  1  1  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,36

## ITERATION 172 #######################


> Neighbours evaluated; 78
> Selected Move:	4150	3	14	10	27500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  1  0  0  1  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,365

## ITERATION 173 #######################


> Neighbours evaluated; 72
> Selected Move:	4088	3	8	14	27500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  1  0  0  1  1  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,37

## ITERATION 174 #######################


> Neighbours evaluated; 90
> Selected Move:	4020	2	13	-1	23500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  1  0  0  0  1  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,375

## ITERATION 175 #######################


> Neighbours evaluated; 112
> Selected Move:	4080	3	14	8	23500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,38

## ITERATION 176 #######################


> Neighbours evaluated; 106
> Selected Move:	3960	3	8	16	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  1  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,385

## ITERATION 177 #######################


> Neighbours evaluated; 108
> Selected Move:	4020	3	19	7	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  0  0  1  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0 
 > pw :0,39

## ITERATION 178 #######################


> Neighbours evaluated; 102
> Selected Move:	3970	3	16	6	24000


> New Y[]: 
	
	 2  3  0  1  0  0  1  1  0  0  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0 
 > pw :0,395

## ITERATION 179 #######################


> Neighbours evaluated; 106
> Selected Move:	3970	3	15	9	24500


> New Y[]: 
	
	 2  3  0  1  0  0  1  1  0  1  1  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 180 #######################


> Neighbours evaluated; 105
> Selected Move:	3910	3	7	19	24000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 181 #######################


> Neighbours evaluated; 111
> Selected Move:	3988	3	6	4	25500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  1  1  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 182 #######################


> Neighbours evaluated; 109
> Selected Move:	3960	3	4	16	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  1  1  0  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 183 #######################


> Neighbours evaluated; 113
> Selected Move:	3860	3	10	8	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  1  0  0  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 184 #######################


> Neighbours evaluated; 109
> Selected Move:	3895	3	16	4	25500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 185 #######################


> Neighbours evaluated; 103
> Selected Move:	3940	3	19	10	23500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  1  1  1  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 186 #######################


> Neighbours evaluated; 115
> Selected Move:	4020	1	-1	13	27500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  1  1  1  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 187 #######################


> Neighbours evaluated; 104
> Selected Move:	3973	3	8	14	27500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  1  1  0  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 188 #######################


> Neighbours evaluated; 114
> Selected Move:	4050	3	9	17	27000


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  0  1  0  0  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 189 #######################


> Neighbours evaluated; 110
> Selected Move:	4040	3	14	6	27000


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  0  0  1  0  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,36

## ITERATION 190 #######################


> Neighbours evaluated; 102
> Selected Move:	4030	3	17	15	27000


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  0  0  1  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,365

## ITERATION 191 #######################


> Neighbours evaluated; 100
> Selected Move:	4003	3	4	18	26500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  1  0  0  1  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,37

## ITERATION 192 #######################


> Neighbours evaluated; 101
> Selected Move:	3995	3	15	4	26500


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  0  0  1  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 193 #######################


> Neighbours evaluated; 107
> Selected Move:	3988	3	4	17	26500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  1  0  0  1  0  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,38

## ITERATION 194 #######################


> Neighbours evaluated; 99
> Selected Move:	3970	3	18	2	26000


> New Y[]: 
	
	 2  3  1  1  0  0  1  0  0  0  1  0  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,385

## ITERATION 195 #######################


> Neighbours evaluated; 82
> Selected Move:	3965	3	17	4	26000


> New Y[]: 
	
	 2  3  1  1  1  0  1  0  0  0  1  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 196 #######################


> Neighbours evaluated; 95
> Selected Move:	3960	3	4	15	26000


> New Y[]: 
	
	 2  3  1  1  0  0  1  0  0  0  1  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,395

## ITERATION 197 #######################


> Neighbours evaluated; 76
> Selected Move:	3903	3	2	19	27500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  1  0  0  1  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,4

## ITERATION 198 #######################


> Neighbours evaluated; 72
> Selected Move:	3910	2	13	-1	23500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  1  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,405

## ITERATION 199 #######################


> Neighbours evaluated; 103
> Selected Move:	3950	3	10	12	25000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  0  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,41

## ITERATION 200 #######################


> Neighbours evaluated; 98
> Selected Move:	4060	3	6	14	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  1  0  1  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,415

## ITERATION 201 #######################


> Neighbours evaluated; 101
> Selected Move:	3930	3	19	17	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  1  0  1  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 202 #######################


> Neighbours evaluated; 107
> Selected Move:	3980	3	12	13	23000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  1  1  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 203 #######################


> Neighbours evaluated; 106
> Selected Move:	4000	3	14	16	24000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  1  0  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,42

## ITERATION 204 #######################


> Neighbours evaluated; 107
> Selected Move:	4010	3	3	8	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  0  0  1  0  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,415

## ITERATION 205 #######################


> Neighbours evaluated; 82
> Selected Move:	3960	3	16	4	24500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  0  0  0  1  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,41

## ITERATION 206 #######################


> Neighbours evaluated; 87
> Selected Move:	3960	3	15	3	23000


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  1  0  0  0  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 207 #######################


> Neighbours evaluated; 110
> Selected Move:	3960	3	0	15	25000


> New Y[]: 
	
	 0  3  0  1  1  0  0  0  1  0  0  0  0  1  0  2  0  1  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,4
________________________________________________________________

Best solution found: 4420
Run Termination time: 03.02.2010 22:01:39
Run duration: 00:04:24.4375000
________________________________________________________________
